//没做出来

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<functional>
#include<numeric>
using namespace std;

class Solution {
public:
    int minimumTimeRequired(vector<int>& jobs, int k) {
       if(jobs.size()<=k){
           return *max_element(jobs.begin(),jobs.end());
       }

       sort(jobs.begin(),jobs.end());
       int sum = accumulate(jobs.begin(),jobs.end(),0);

       //尽量分为k等分
       
        vector<int> temp;





             
    }
 };  